A Deterministic Logical Semantics for Esterel
نویسندگان
چکیده
منابع مشابه
A Deterministic Logical Semantics for Esterel
Esterel is a synchronous design language for the specification of reactive systems. There exist two main semantics for Esterel. On the one hand, the logical behavioral semantics provides a simple and compact formalization of the behavior of programs using SOS rules. But it does not ensure deterministic executions for all programs and all inputs. As non-deterministic programs have to be rejected...
متن کاملLogical semantics of Esterel with unconstrained local signals
Esterel is a synchronous programming language where processes interact through signals. The logical semantics of this language express the meaning of each syntactic constructions, knowing a priori the set of emitted signals. Nevertheless, a special case have to be made for local signals, making the semantics non-deterministic. In this paper, we propose a new logical semantics where the rules ar...
متن کاملThe Semantics of Pure Esterel
We present a survey of the main semantics of Pure Esterel, the communication kernel of the Esterel synchronous reactive language. We start by an informal presentation of the Pure Esterel language. We then present the be-havioral semantics that deenes the language. We deene the notion of a haltset that corresponds to a distributed program counter. Using haltsets, we show that Pure Esterel progra...
متن کاملA Compositional Semantics of Esterel in DurationCalculus
In this paper, we describe the behaviour of esterel programs in a variant of durational calculus referred to as Mean Value Calculus (MVC). The formalization enables the axiomatization of the assumptions of the underlying model precisely. It provides a compositional denotational semantics of the esterel The algebraic rules of MVC can be used to prove properties of esterel statements and thus, pr...
متن کاملLogical Semantics for Stability
Type assignment systems for λ-calculus based on intersection types are a general framework for building models of λ-calculus (known as filter-models) which are useful tools for reasoning in a finitary way about the denotational intepretation of terms. Indeed the denotation of a term is the set of types derivable for it and a type is a “finite piece” of information on such a denotation. This app...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2005
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2004.09.040